Faster gossiping on butterfly networks
نویسندگان
چکیده
منابع مشابه
Faster Gossiping on Butter ies?
Gossiping has been considered intensively for butterries and \regular" butterries (which have no wrap-around connections). In the telephone communication model, for a butterry of order k, the best previous gossiping algorithms require 2 1 = 2 k and 3 k communication rounds, respectively. By new asymptotic methods we break through these bounds, proving new bounds of 2 1 = 4 k + o(k) and 2 1 = 2 ...
متن کاملFaster Deterministic Gossiping in Directed Ad Hoc Radio Networks
We study the gossiping problem in directed ad-hoc radio networks. Our main result is a deterministic algorithm that solves this problem in an n-node network in time O(n log n). The algorithm allows the labels (identifiers) of the nodes to be polynomially large in n, and is based on a novel way of using selective families. The previous best general (i.e., dependent only on n) deterministic upper...
متن کاملBrief Announcement: Faster Gossiping in Bidirectional Radio Networks with Large Labels
We consider unknown ad-hoc radio networks, when the underlying network is bidirectional and nodes can have polynomially large labels. For this model, we present a deterministic protocol for gossiping which takes O(n lg n lg lgn) rounds. This improves upon the previous best result for deterministic gossiping for this model by [Gasienec, Potapov, Pagourtizis, Deterministic Gossiping in Radio Netw...
متن کاملMaxDDBS problem on butterfly networks
A maximum degree-diameter bounded subgraph problem can be seen as a degree-diameter problem restricted to certain host graphs. In this paper, we investigate the MaxDDBS problem when the host graph is a butterfly network. We give constructive lower bounds for subgraphs of maximum degree 4, 3 and 2. ∗ Was also at Department of Mathematics, University of West Bohemia, Pilsen, Czech Republic. Decea...
متن کاملGossiping in Bus Interconnection Networks
Several architectures have been proposed to enhance point-to-point architectures with the addition of multiple bus systems. In particular, we consider an architecture for a massively parallel system where processors are connected solely by buses. These archi-tectures can use the power of bus technologies, providing a way to interconnect much more processors in a simple and eecient manner. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.09.032